منابع مشابه
Saturated free algebras revisited
We give an exposition of results of Baldwin-Shelah [2] on saturated free algebras, at the level of generality of complete first order theories T with a saturated model M which is in the algebraic closure of an indiscernible set. We then make some new observations when M is a saturated free algebra, analogous to (more difficult) results for the free group, such as a description of forking.
متن کاملFree Heyting Algebras: Revisited
We use coalgebraic methods to describe finitely generated free Heyting algebras. Heyting algebras are axiomatized by rank 0-1 axioms. In the process of constructing free Heyting algebras we first apply existing methods to weak Heyting algebras—the rank 1 reducts of Heyting algebras—and then adjust them to the mixed rank 0-1 axioms. On the negative side, our work shows that one cannot use arbitr...
متن کاملFree modal algebras revisited: the step-by-step method
We review the step-by-step method of constructing finitely generated free modal algebras. First we discuss the global step-by-step method, which works well for rank one modal logics. Next we refine the global step-by-step method to obtain the local step-by-step method, which is applicable beyond rank one modal logics. In particular, we show that it works well for constructing the finitely gener...
متن کاملAlgebras of shapes revisited
This paper aims to contribute to a better understanding of algebras of shapes as they are applied in a design theory, which involves shape grammars. Three different formats of these algebras, which (surprisingly) differ in behavior, will be explored. Some earlier informal ideas on algebras of shapes will be revisited and a formal underpinning will be provided. In particular, two different sums ...
متن کاملRough Relation Algebras Revisited
Rough relation algebras arise from Pawlak’s information systems by considering as object ordered pairs on a fixed set X . Thus, the subsets to be approximated are binary relations over X , and hence, we have at our disposal not only the set theoretic operations, but also the relational operators ; , ̆ , and the identity relation 1′. In the present paper, which is a continuation of [6], we furth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Bulletin of Symbolic Logic
سال: 2015
ISSN: 1079-8986,1943-5894
DOI: 10.1017/bsl.2015.23